Isomorphism Classes of Maximal Intersecting Uniform Families Are Few
نویسنده
چکیده
Denote by f(k,m) the number of isomorphism classes of maximal intersecting k-uniform families of subsets of [m]. In this note we prove the existence of a constant f(k) such that f(k,m) ≤ f(k) for all values of m.
منابع مشابه
Intersecting Families — Uniform versus Weighted
What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.
متن کاملMaximal Intersecting Families of Finite Sets and «uniform Hjelmslev Planes
The following theorem is proved. The collection of lines of an n-uniform projective Hjelmslev plane is maximal when considered as a collectiion of mutually intersecting sets of equal cardinality.
متن کاملIntersecting families of discrete structures are typically trivial
The study of intersecting structures is central to extremal combinatorics. A family of permutations F ⊂ Sn is t-intersecting if any two permutations in F agree on some t indices, and is trivial if all permutations in F agree on the same t indices. A k-uniform hypergraph is tintersecting if any two of its edges have t vertices in common, and trivial if all its edges share the same t vertices. Th...
متن کاملBounds on sets with few distances
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: • we improve the Ray-Chaudhuri–Wilson bound of the size of uniform intersecting families of subsets; • we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances; • we prove a new bound on codes with few dista...
متن کاملOn the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method
We study the function M(n, k) which denotes the number of maximal k-uniform intersecting families F ⊆ ([n] k ) . Improving a bound of Balogh, Das, Delcourt, Liu and Sharifzadeh on M(n, k), we determine the order of magnitude of logM(n, k) by proving that for any fixed k, M(n, k) = nΘ(( 2k k )) holds. Our proof is based on Tuza’s set pair approach. The main idea is to bound the size of the large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005